An Efficient Algorithm for MDL Based Graph Summarization for Dense Graphs
نویسندگان
چکیده
In-memory visualization and analysis of graphs is hard if they cannot be fit in the memory. For this purpose, creating a summary graph to understand their insights is very useful. In this paper, we present an efficient algorithm for MDL based graph summarization to compress big graphs. We have evaluated the performance of the proposed algorithm on a real graph and observe better execution time than the state of the art, at similar accuracy.
منابع مشابه
Graph Hybrid Summarization
One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...
متن کاملAn Empirical Comparison of the Summarization Power of Graph Clustering Methods
How do graph clustering techniques compare with respect to their summarization power? How well can they summarize a million-node graph with a few representative structures? Graph clustering or community detection algorithms can summarize a graph in terms of coherent and tightly connected clusters. In this paper, we compare and contrast different techniques: METIS, Louvain, spectral clustering, ...
متن کاملReducing Million-Node Graphs to a Few Structural Patterns: A Unified Approach
How do graph clustering techniques compare in terms of summarization power? How well can they summarize a million-node graph with a few representative structures? In this paper, we compare and contrast different techniques: METIS, LOUVAIN, SPECTRAL CLUSTERING, SLASHBURN, BIGCLAM, HYCOMFIT, and KCBC, our proposed k-core-based clustering method. Unlike prior work that focuses on various measures ...
متن کاملSummarizing and understanding large graphs
How can we succinctly describe a million-node graph with a few simple sentences? Given a large graph, how can we find its most ‘important’ structures, so that we can summarize it and easily visualize it? How can we measure the ‘importance’ of a set of discovered subgraphs in a large graph? Starting with the observation that real graphs often consist of stars, bipartite cores, cliques and chains...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014